Realizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks

نویسندگان

  • Greg Gravenstreter
  • Rami G. Melhem
چکیده

We consider the problem of realizing several common communication structures in the all-optical Partitioned Optical Passive Stars (POPS) topology. We show that, often, the obvious or “natural” method of implementing a communication pattern in the POPS does not efficiently utilize its communication capabilities. We present techniques which distribute the communication load uniformly in the POPS for four of the most common communication patterns (all-to-all personalized, global reduction operations, ring, and torus). We prove that these techniques provide optimal performance in the sense that they minimize the time required to deliver the messages from each node to its neighbors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Partitioned Optical Passive Stars (POPS) topology

This paper presents and analyzes a topological approach to providing multiple data channels using current technologies. The Partitioned Optical Passive Stars (POPS) topology is an all-optical interconnec-tion architecture that uses multiple non-hierarchical couplers. POPS topologies provide powerful conng-urability for optimization of system complexity, network throughput, power budget, and con...

متن کامل

Routing Permutations in Partitioned Optical Passive Star Networks

It is shown that a Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can route any permutation among the n = dg processors in one slot when d = 1 and 2⌈d/g⌉ slots when d > 1. The number of slots used is optimal in the worst case, and is at most the double of the optimum for all permutations π such that π(i) = i, for all i.

متن کامل

Mapping Hypercube Computations onto Partitioned Optical Passive Star Networks

This paper shows that an n = 2 processor Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can simulate either a mono-directional move of an n processor hypercube or a bi-directional move of an n/2 processor hypercube using one slot when d = 1 and d/g slots when d > 1. Moreover, as a direct application of the simulation, it is shown how a POPS(d, g) netwo...

متن کامل

Parallel Computation of Data Summation for Multiple Problem Spaces on Partitioned Optical Passive Stars Network

In Partitioned Optical Passive Stars POPS network, nodes and couplers become free after slot to slot in some computation. It is necessary to efficiently utilize free couplers and nodes to be cost effective. Improving parallelism, we present the fast data summation algorithm for multiple problem spaces on POPS(g, g) with smaller number of nodes for the case of d = √ n = g. For the case of d > √ ...

متن کامل

Routing permutations in Partitioned Optical Passive Stars Networks

It is shown that a Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can route any permutation among the n = dg processors in one slot when d = 1 and 2dd=ge slots when d > 1. The number of slots used is optimal in the worst case, and is at most the double of the optimum for all permutations π such that π(i) 6= i, for all i.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 47  شماره 

صفحات  -

تاریخ انتشار 1998